TSTP Solution File: SEV258^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV258^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:56 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV258^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 11:45:19 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.xGYQcogK8n/Vampire---4.8_8646
% 0.20/0.38 % (8761)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.20/0.38 % (8760)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.20/0.38 % (8759)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.38 % (8762)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.20/0.38 % (8761)First to succeed.
% 0.20/0.38 % (8759)Instruction limit reached!
% 0.20/0.38 % (8759)------------------------------
% 0.20/0.38 % (8759)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (8759)Termination reason: Unknown
% 0.20/0.38 % (8759)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (8759)Memory used [KB]: 895
% 0.20/0.38 % (8759)Time elapsed: 0.003 s
% 0.20/0.38 % (8759)Instructions burned: 2 (million)
% 0.20/0.38 % (8759)------------------------------
% 0.20/0.38 % (8759)------------------------------
% 0.20/0.38 % (8760)Also succeeded, but the first one will report.
% 0.20/0.38 % (8756)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.20/0.38 % (8757)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.20/0.38 % (8762)Also succeeded, but the first one will report.
% 0.20/0.38 % (8761)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for Vampire---4
% 0.20/0.38 % SZS output start Proof for Vampire---4
% 0.20/0.38 tff(type_def_5, type, a: $tType).
% 0.20/0.38 tff(func_def_0, type, a: $tType).
% 0.20/0.38 fof(f8,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 fof(f7,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(true_and_false_elimination,[],[f6])).
% 0.20/0.38 fof(f6,plain,(
% 0.20/0.38 ~(! [X0 : sTfun(a,$o)] : (vLAM(a,$o,vAPP($o,$o,vNOT,$false)) = X0 => $true) & ! [X1 : sTfun(a,$o),X2 : sTfun(sTfun(a,$o),$o)] : ((vLAM(a,$o,vAPP(sTfun(sTfun(a,$o),$o),$o,vSIGMA(sTfun(a,$o)),vLAM(sTfun(a,$o),$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(a,$o,db0(sTfun(a,$o)),db1(a))),vAPP(sTfun(a,$o),$o,X2,db0(sTfun(a,$o))))))) = X1 & ! [X3 : sTfun(a,$o)] : ((vAPP(sTfun(a,$o),$o,X2,X3) = $true) => $true)) => $true) & ! [X4 : sTfun(a,$o)] : (vLAM(a,$o,$false) = X4 => $true) & ! [X5 : sTfun(a,$o),X6 : sTfun(a,$o),X7 : sTfun(a,$o)] : (($true & vLAM(a,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(a,$o,X5,db0(a))),vAPP(a,$o,X7,db0(a)))) = X6 & $true) => $true))),
% 0.20/0.38 inference(rectify,[],[f5])).
% 0.20/0.38 fof(f5,plain,(
% 0.20/0.38 ~(! [X0 : sTfun(a,$o)] : (vLAM(a,$o,vAPP($o,$o,vNOT,$false)) = X0 => $true) & ! [X2 : sTfun(a,$o),X3 : sTfun(sTfun(a,$o),$o)] : ((vLAM(a,$o,vAPP(sTfun(sTfun(a,$o),$o),$o,vSIGMA(sTfun(a,$o)),vLAM(sTfun(a,$o),$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(a,$o,db0(sTfun(a,$o)),db1(a))),vAPP(sTfun(a,$o),$o,X3,db0(sTfun(a,$o))))))) = X2 & ! [X6 : sTfun(a,$o)] : ((vAPP(sTfun(a,$o),$o,X3,X6) = $true) => $true)) => $true) & ! [X7 : sTfun(a,$o)] : (vLAM(a,$o,$false) = X7 => $true) & ! [X9 : sTfun(a,$o),X10 : sTfun(a,$o),X11 : sTfun(a,$o)] : (($true & vLAM(a,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(a,$o,X9,db0(a))),vAPP(a,$o,X11,db0(a)))) = X10 & $true) => $true))),
% 0.20/0.38 inference(fool_elimination,[],[f4])).
% 0.20/0.38 fof(f4,plain,(
% 0.20/0.38 ~(! [X0 : sTfun(a,$o)] : ((^[X1 : a] : (~$false)) = X0 => $true) & ! [X2 : sTfun(a,$o),X3 : sTfun(sTfun(a,$o),$o)] : ((X2 = (^[X4 : a] : (? [X5 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X3,X5) & vAPP(a,$o,X5,X4)))) & ! [X6 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X3,X6) => $true)) => $true) & ! [X7 : sTfun(a,$o)] : (X7 = (^[X8 : a] : ($false)) => $true) & ! [X9 : sTfun(a,$o),X10 : sTfun(a,$o),X11 : sTfun(a,$o)] : (($true & (^[X12 : a] : (vAPP(a,$o,X11,X12) & vAPP(a,$o,X9,X12))) = X10 & $true) => $true))),
% 0.20/0.38 inference(rectify,[],[f2])).
% 0.20/0.38 fof(f2,negated_conjecture,(
% 0.20/0.38 ~(! [X0 : sTfun(a,$o)] : ((^[X1 : a] : (~$false)) = X0 => $true) & ! [X0 : sTfun(a,$o),X2 : sTfun(sTfun(a,$o),$o)] : ((X0 = (^[X1 : a] : (? [X3 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X2,X3) & vAPP(a,$o,X3,X1)))) & ! [X1 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X2,X1) => $true)) => $true) & ! [X0 : sTfun(a,$o)] : (X0 = (^[X1 : a] : ($false)) => $true) & ! [X4 : sTfun(a,$o),X3 : sTfun(a,$o),X5 : sTfun(a,$o)] : (($true & (^[X1 : a] : (vAPP(a,$o,X5,X1) & vAPP(a,$o,X4,X1))) = X3 & $true) => $true))),
% 0.20/0.38 inference(negated_conjecture,[],[f1])).
% 0.20/0.38 fof(f1,conjecture,(
% 0.20/0.38 ! [X0 : sTfun(a,$o)] : ((^[X1 : a] : (~$false)) = X0 => $true) & ! [X0 : sTfun(a,$o),X2 : sTfun(sTfun(a,$o),$o)] : ((X0 = (^[X1 : a] : (? [X3 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X2,X3) & vAPP(a,$o,X3,X1)))) & ! [X1 : sTfun(a,$o)] : (vAPP(sTfun(a,$o),$o,X2,X1) => $true)) => $true) & ! [X0 : sTfun(a,$o)] : (X0 = (^[X1 : a] : ($false)) => $true) & ! [X4 : sTfun(a,$o),X3 : sTfun(a,$o),X5 : sTfun(a,$o)] : (($true & (^[X1 : a] : (vAPP(a,$o,X5,X1) & vAPP(a,$o,X4,X1))) = X3 & $true) => $true)),
% 0.20/0.38 file('/export/starexec/sandbox/tmp/tmp.xGYQcogK8n/Vampire---4.8_8646',cDISCRETE_TOPOLOGY_pme)).
% 0.20/0.38 % SZS output end Proof for Vampire---4
% 0.20/0.38 % (8761)------------------------------
% 0.20/0.38 % (8761)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (8761)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (8761)Memory used [KB]: 5500
% 0.20/0.38 % (8761)Time elapsed: 0.003 s
% 0.20/0.38 % (8761)Instructions burned: 1 (million)
% 0.20/0.38 % (8761)------------------------------
% 0.20/0.38 % (8761)------------------------------
% 0.20/0.38 % (8754)Success in time 0.014 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------